Fast Maximum Likelihood Estimation via Equilibrium Expectation for Large Network Data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Spatial Gaussian Process Maximum Likelihood Estimation via Skeletonization Factorizations

Maximum likelihood estimation for parameter-fitting given observations from a Gaussian process in space is a computationally-demanding task that restricts the use of such methods to moderately-sized datasets. We present a framework for unstructured observations in two spatial dimensions that allows for evaluation of the log-likelihood and its gradient (i.e., the score equations) in Õpn3{2q time...

متن کامل

Maximum Lq-Likelihood Estimation via the Expectation Maximization Algorithm: A Robust Estimation of Mixture Models

We introduce a maximum Lq-likelihood estimation (MLqE) of mixture models using our proposed expectation maximization (EM) algorithm, namely the EM algorithm with Lq-likelihood (EM-Lq). Properties of the MLqE obtained from the proposed EMLq are studied through simulated mixture model data. Compared with the maximum likelihood estimation (MLE) which is obtained from the EM algorithm, the MLqE pro...

متن کامل

Maximum Likelihood Estimation for Social Network Dynamics.

A model for network panel data is discussed, based on the assumption that the observed data are discrete observations of a continuous-time Markov process on the space of all directed graphs on a given node set, in which changes in tie variables are independent conditional on the current graph. The model for tie changes is parametric and designed for applications to social network analysis, wher...

متن کامل

Maximum Likelihood Estimation for Lossy Data Compression∗

In lossless data compression, given a sequence of observations (Xn)n≥1 and a family of probability distributions {Qθ}θ∈Θ, the estimators (θ̃n)n≥1 obtained by minimizing the ideal Shannon code-lengths over the family {Qθ}θ∈Θ, θ̃n := arg min θ∈Θ [ − logQθ(X 1 ) ] , whereXn 1 := (X1, X2, . . . , Xn), coincide with the classical maximum-likelihood estimators (MLEs). In the corresponding lossy compres...

متن کامل

Identifying Community Structures from Network Data via Maximum Likelihood Methods

Networks of social and economic interactions are often influenced by unobserved structures among the nodes. We develop a simple model of how hidden community structure generates networks of interactions and then axiomatize a method of identifying the latent community structures from network data. The method is based on maximum likelihood estimation. ∗Čopič is the department of economics at UCLA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2018

ISSN: 2045-2322

DOI: 10.1038/s41598-018-29725-8